Relatively Unrestricted Quantification
نویسنده
چکیده
There are four broad grounds upon which the intelligibility of quantification over absolutely everything has been questioned—one based upon the existence of semantic indeterminacy, another on the relativity of ontology to a conceptual scheme, a third upon the necessity of sortal restriction, and the last upon the possibility of indefinite extendibility. The argument from semantic indeterminacy derives from general philosophical considerations concerning our understanding of language. For the Skolem–Lowenheim Theorem appears to show that an understanding of quantification over absolutely everything (assuming a suitably infinite domain) is semantically indistinguishable from the understanding of quantification over something less than absolutely everything; the same first-order sentences are true and even the same first-order conditions will be satisfied by objects from the narrower domain. From this it is then argued that the two kinds of understanding are indistinguishable tout court and that nothing could count as having the one kind of understanding as opposed to the other. The second two arguments reject the bare idea of an object as unintelligible, one taking it to require supplementation by reference to a conceptual scheme and the other taking it to require supplementation by reference to a sort. Thus we cannot properly make sense of quantification over mere objects, but only over objects of such and such a conceptual scheme or of such and such a sort. The final argument, from indefinite extendibility, rejects the idea of a completed totality. For if we take ourselves to be quantifying over all objects, or even over all sets, then the reasoning of Russell’s paradox can be exploited to demonstrate the possibility of quantifying over a more inclusive domain. The intelligibility of absolutely unrestricted quantification, which should be free from such incompleteness, must therefore be rejected. The ways in which these arguments attempt to the undermine the intelligibility of absolutely unrestricted quantification are very different; and each calls for extensive discussion in its own right. However, my primary concern in the present paper is with the issue of indefinite extendibility; and I shall only touch upon the other arguments in so far as they bear upon this particular issue. I myself am not persuaded by
منابع مشابه
Sets, Properties, and Unrestricted Quantification
Call a quantifier unrestricted if it ranges over absolutely all things: not just over all physical things or all things relevant to some particular utterance or discourse but over absolutely everything there is. Prima facie, unrestricted quantification seems to be perfectly coherent. For such quantification appears to be involved in a variety of claims that all normal human beings are capable o...
متن کاملAnalytical Methods for Quantification of Drug Metabolites in Biological Samples
© 2012 Roškar and Trdan Lušin, licensee InTech. This is an open access chapter distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Analytical Methods for Quantification of Drug Metabolites in Biological Samples
متن کاملModified, Rapid, and Accurate Method for the Quantification of Mucopolysaccharides in Urine
A modified colorimetric method for the determination of urinary mucopolysaccharides is presented. It involves reaction with Alcian blue dye under relatively mild conditions and reading in the visible spectrophotometry at 608 nm. It is more sensitive than the original method as it measures all classes of urinary mucopolysaccharides. Results in normal children at different ages corrected to creat...
متن کاملPropositional Dynamic Logic with Program Quantifiers
We consider an extension QPDL of Segerberg-Pratt’s Propositional Dynamic Logic PDL, with program quantification, and study its expressive power and complexity. A mild form of program quantification is obtained in the calculus μPDL, extending PDL with recursive procedures (i.e. context free programs), which is known to be Π 1 -complete. The unrestricted program quantification we consider leads t...
متن کامل